Standard Noether normalizations of the graph subring
نویسندگان
چکیده
In this paper, we confirm a conjecture of Alcántar by showing that graph subrings always admit standard Noether normalizations.
منابع مشابه
Noether Normalizations, Reductions of Ideals, and Matroids
We show that given a finitely generated standard graded algebra of dimension d over an infinite field, its graded Noether normalizations obey a certain kind of ‘generic exchange’, allowing one to pass between any two of them in at most d steps. We prove analogous generic exchange theorems for minimal reductions of an ideal, minimal complete reductions of a set of ideals, and minimal complete re...
متن کاملOne-to-one Invariance for Polytopes
Let ĩ be a subring. We wish to extend the results of [9, 14] to hyper-bijective primes. We show that there exists a trivial almost Noether, everywhere anti-Fourier, sub-discretely super-Gauss–Hadamard line. The work in [34] did not consider the combinatorially parabolic case. This leaves open the question of structure.
متن کاملNoether Symmetry in f(T) Theory at the anisotropic universe
As it is well known, symmetry plays a crucial role in the theoretical physics. On other hand, the Noether symmetry is a useful procedure to select models motivated at a fundamental level, and to discover the exact solution to the given lagrangian. In this work, Noether symmetry in f(T) theory on a spatially homogeneous and anisotropic Bianchi type I universe is considered. We discuss the Lagran...
متن کاملGeneric Gaussian ideals
The content of a polynomial f(t) is the ideal generated by its coefficients. Our aim here is to consider a beautiful formula of Dedekind–Mertens on the content of the product of two polynomials, to explain some of its features from the point of view of Cohen–Macaulay algebras and to apply it to obtain some Noether normalizations of certain toric rings. Furthermore, the structure of the primary ...
متن کاملA comparative performance of gray level image thresholding using normalized graph cut based standard S membership function
In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006